Comparing Different Projection Operators in Cylindrical Algebraic Decomposition for SMT Solving
نویسندگان
چکیده
Satisfiability-modulo-theories (SMT) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving for non-linear real arithmetic, the cylindrical algebraic decomposition (CAD) can be embedded as a theory solver to solve sets (conjunctions) of polynomial constraints. When developing such a CAD theory solver, a design choice is given by the selection of the projection operator used in the CAD method. In this paper we provide some experimental evaluations to analyse how the choice of the projection operator affects the computational efficiency of SMT solving.
منابع مشابه
Comparing Different Projection Operators in the Cylindrical Algebraic Decomposition for SMT Solving
Satisfiability-modulo-theories (SMT) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving for non-linear real arithmetic, the cylindrical algebraic decomposition (CAD) can be embedded as a theory solver to solve sets (conjunctions) of polynomial constraints. When developing such a CAD theory solver, a design choice is given by the selection of th...
متن کاملA Successive Resultant Projection for Cylindrical Algebraic Decomposition
Abstract This note shows the equivalence of two projection operators which both can be used in cylindrical algebraic decomposition (CAD) . One is known as Brown’s Projection (C. W. Brown (2001)); the other was proposed by Lu Yang in his earlier work (L.Yang and S. H. Xia (2000)) that is sketched as follows: given a polynomial f in x1, x2, · · · , by f1 denote the resultant of f and its partial ...
متن کاملEmbedding the Virtual Substitution Method in the Model Constructing Satisfiability Calculus Framework
Satisfiability-modulo-theories (SMT ) solving is a technique to check the satisfiability of logical formulas. In the context of SMT solving, recently a novel technique called the model-constructing satisfiability calculus (MCSAT ) was introduced in [13, 9], with a nice embedding of the cylindrical algebraic decomposition method as a theory solving module for non-linear real arithmetic [7]. In t...
متن کاملThe Potential and Challenges of CAD with Equational Constraints for SC-Square
Cylindrical algebraic decomposition (CAD) is a core algorithm within Symbolic Computation, particularly for quantifier elimination over the reals and polynomial systems solving more generally. It is now finding increased application as a decision procedure for Satisfiability Modulo Theories (SMT) solvers when working with non-linear real arithmetic. We discuss the potentials from increased focu...
متن کاملOn Gröbner Bases in the Context of Satisfiability-Modulo-Theories Solving over the Real Numbers
We address satisfiability checking for the first-order theory of the real-closed field (RCF) using satisfiability-modulo-theories (SMT) solving. SMT solvers combine a SAT solver to resolve the Boolean structure of a given formula with theory solvers to verify the consistency of sets of theory constraints. In this paper, we report on an integration of Gröbner bases as a theory solver so that it ...
متن کامل